Modular Minimization of Deterministic Finite State Machines
نویسندگان
چکیده
This work presents a modular technique for minimizing a deterministic nite state ma chine FSM while preserving its equivalence to the original system Being modular the minimization technique should consume less time and space Preserving equivalence the resulting minimized model can be employed in both temporal logic model checking and sequential equivalence checking thus reducing their time and space consumption As deterministic FSMs are commonly used for modeling hardware designs our approach is suitable for formal veri cation of such designs We develop a new BDD framework for the representation and manipulation of func tions and show how our minimization technique can be e ectively implemented within this framework
منابع مشابه
Symbolic cover minimization of fully I/O specified finite state machines
Symbolic cover minimization is an important step within a well-known state-assignment technique for finite state machines (FSM’s) 121. Currently, multiple-valued-input logic minimization techniques are used to find a minimum symbolic cover. The former problem, however, is computationally intractable, so heuristics are used. We show a simplified technique, based on an extension of the FSM minimi...
متن کاملMinimization of Finite State Machines 1 Miroslava
We have formalized deterministic finite state machines closely following the textbook [9], pp. 88–119 up to the minimization theorem. In places, we have changed the approach presented in the book as it turned out to be too specific and inconvenient. Our work also revealed several minor mistakes in the book. After defining a structure for an outputless finite state machine, we have derived the s...
متن کاملThe Reactive Engine for Modular Transducers
This paper explains the design of the second release of the Zen toolkit [5–7]. It presents a notion of reactive engine which simulates finite-state machines represented as shared aums [8]. We show that it yields a modular interpreter for finite state machines described as local transducers. For instance, in the manner of Berry and Sethi, we define a compiler of regular expressions into a schedu...
متن کاملMinimization of Finite State Machines1
We have formalized deterministic finite state machines closely following the textbook [10], pp. 88–119 up to the minimization theorem. In places, we have changed the approach presented in the book as it turned out to be too specific and inconvenient. Our work also revealed several minor mistakes in the book. After defining a structure for an outputless finite state machine, we have derived the ...
متن کاملModular Minimization of Finite State Machines
This work presents a modular technique for minimizing a nite state machine FSM while preserving its equivalence to the original system Being modular the minimization technique should consume less time and space Preserving equivalence the resulting minimized model can be employed in both temporal logic model checking and sequential equivalence checking thus reducing their time and space consumpt...
متن کامل